Modified Gaussian Elimination without Division Operations
نویسنده
چکیده
A new modified method based on the Gaussian elimination method for solution of linear system of equations in the projective space is formulated. It is based on application of projective extension of the Euclidean space and use of homogeneous coordinates. It leads to an elimination of division operation and higher precision due to division operation elimination. The approach is based on understanding that a solution of the linear system is equivalent to the extended cross-product, i.e. . As it can be seen there no division is needed. Use of the projective representation enables to avoid division operation and use advantages of the matrix-vector architectures. Division operations have to be used only if the final result of computation has to be in the Euclidean representation. The proposed method was implemented in C# and C++ and experimentally verified. It is especially convenient for computations on GPUs based architectures.
منابع مشابه
Gaussian elimination without rounding
The usual procedure to compute the determinant is the so-called Gaussian elimination. We can view this as the transformation of the matrix into a lower triangular matrix with column operations. These transformations do not change the determinant but in the triangular matrix, the computation of the determinant is more convenient: we must only multiply the diagonal elements to obtain it. (It is a...
متن کاملParallel Architecture for the Solution of Linear Equations Systems Based on Division Free Gaussian Elimination Method Implemented in FPGA
This paper presents a parallel architecture for the solution of linear equations systems based on the Division Free Gaussian Elimination Method. This architecture was implemented in a Field Programmable Gate Array (FPGA). The division-free Gaussian elimination method was integrated in identical processors in a FPGA Spartan 3 of Xilinx. A top-down design was used. The proposed architecture can h...
متن کاملAchieving a log(n) Speed Up for Boolean Matrix Operations and Calculating the Complexity of the Dense Linear Algebra step of Algebraic Stream Cipher Attacks and of Integer Factorization Methods
The purpose of this paper is to calculate the running time of dense boolean matrix operations, as used in stream cipher cryptanalysis and integer factorization. Several variations of Gaussian Elimination, Strassen’s Algorithm and the Method of Four Russians are analyzed. In particular, we demonstrate that Strassen’s Algorithm is actually slower than the Four Russians algorithm for matrices of t...
متن کاملLinear and nonlinear optical properties of a modified Gaussian quantum dot: pressure, temperature and impurity effect
In this paper, the effect of pressure, temperature and impurity on the energylevels, binding energy, linear and nonlinear optical properties of a modified Gaussianquantum dot are studied. In this regard, the finite element method is employed to solvethe single electron Schrodinger equation in the effective mass approximation with andwithout impurity at the center of the dot. In addition, the en...
متن کاملSome P-RAM Algorithms for Sparse Linear Systems
PRAM algorithms for Symmetric Gaussian elimination is presented. We showed actual testing operations that will be performed during Symmetric Gaussian elimination, which caused symbolic factorization to occur for sparse linear systems. The array pattern of processing elements (PE) in row major order for the specialized sparse matrix in formulated. We showed that the access function in+jn+k conta...
متن کامل